Separate-and-conquer Regression
نویسندگان
چکیده
In this paper a rule learning algorithm for the prediction of numerical target variables is presented. It is based on the separate-and-conquer strategy and the classification phase is done by a decision list. A new splitpoint generation method is introduced for the efficient handling of numerical attributes. It is shown that the algorithm performs comparable to other regression algorithms where some of them are based on rules and some are not. Additionally a novel heuristic for evaluating the trade-off between consistency and generality of regression rules is introduced. This heuristic features a parameter to directly trade off the rules consistency and its generality. We present an optimal setting for this parameter based on optimizing it on several data sets. The algorithm features two additional parameters that are also tuned on the same datasets as the heuristics parameter. The evaluation part of the paper gives insights on results obtained on tuning datasets that were split into two folds of equal size. The algorithm was tuned on the first set of these split databases and is evaluated on the hold-out folds and vice versa yielding two configurations of the rule learner. These are also evaluated on 9 testing datasets that were not used during the optimization.
منابع مشابه
The SECO-framework for rule learning
This document describes a rule learning framework called SeCo (derived from Separate-and-Conquer). This framework uses building blocks to specify each component that is needed to build up a configuration for a rule learner. It is based on a general separate-and-conquer algorithm. The framework allows to configurate any given rule learner that fulfills some properties. These are mainly that it e...
متن کاملAn Overview of Alternative Rule Evaluation Criteria and Their Use in Separate-and-Conquer Classifiers
Separate-and-conquer classifiers strongly depend on the criteria used to choose which rules will be included in the classification model. When association rules are employed to build such classifiers (as in ART [3]), rule evaluation can be performed attending to different criteria (other than the traditional confidence measure used in association rule mining). In this paper, we analyze the desi...
متن کاملParallel Rule Induction with Information Theoretic Pre-Pruning
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to inducing classification rules, one is the divide and conquer approach, also known as the top down induction of decision trees; the other approach is called the separate and conquer approach. A considerable amount of work ...
متن کاملCombining Divide-and-Conquer and Separate-and-Conquer for Efficient and Effective Rule Induction
متن کامل
Conquer-92 Revised Report on the Conceptual Query Language Lisa-d
In this report the conceptual query language ConQuer-92 is introduced. This query language serves as the backbone of InfoAssistant's query facilities. Furthermore , this language can also be used for the specification of derivation rules (e.g. subtype defining rules) and textual constraints in InfoModeler. This report is solely concerned with a formal definition, and the explanation thereof, of...
متن کامل